Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems

An interior point method is proposed to solve variational inequality problems for monotone functions and polyhedral sets. The method has the following advantages. 1. Given an initial interior feasible solution with duality gap 0 , the algorithm requires at most On log(0 ==)] iterations to obtain an-optimal solution. 2. The rate of convergence of the duality gap is q-quadratic. 3. At each iteration, a long-step improvement based on a line search is allowed. 4. The algorithm can automatically transfer from a linear mode to a quadratic mode to accelerate the local convergence.